Specifying and solving symbolic and numeric temporal constraints

نویسندگان

  • Samira Sadaoui
  • Malek Mouhoub
  • Xiao Feng Li
چکیده

Representing and solving combinatorial problems, especially those including temporal constraints, using a constraint programming language remains a challenging task. In this paper, we present a tool to assist users in specifying and solving problems under qualitative and quantitative temporal constraints. The tool is based on the TemPro framework that has the ability to manage both numeric and symbolic temporal constraints within a unique model. Our tool provides a generic template that can be specialized to describe a wide variety of temporal constraint applications. Given a problem under temporal constraints, the proposed tool with its friendly graphical user interface first assists the user in the different steps of the problem specification. The graph representation of the temporal constraint problem and its consistent scenarios are then automatically generated and visualized during the solving phase. The user has also the ability to add or remove some constraints and see the effects of these changes on the consistency of the problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Temporal Network for Numeric and Symbolic Time Information

We propose a probabilistic extension of Allen’s Interval Algebra for managing uncertain temporal relations. Although previous work on various uncertain forms of quantitative and qualitative temporal networks have been proposed in the literature, little has been addressed to the most obvious type of uncertainty, namely the probabilistic one. More precisely, our model adapts the probabilistic Con...

متن کامل

Extensions of Constraint Solving for Proof Planning

The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver such as consistency check, constraint inference, as well as the search for instantiations. However, off-the-shelf constraint solvers need to be extended in order to be be integrated appropriately: In particular, for cor...

متن کامل

Java with CREAM for Temporal Constraints

Computational problems from many different application areas can be seen as temporal constraint-based problems. For example, scheduling, planning, computational linguistics and database design applications can all be seen in this way. In this paper we present a temporal constraint solver based on the Java Cream constraint library for managing problems involving numeric and symbolic temporal inf...

متن کامل

Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic

A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The symbolic step generates a new system, such the formulas are different but the solutions are preserved, through partial factorizations of polynomial expressions, and constraint inversion. The numeric step is a branch-and-prune algorithm based on interval constraint propagation to compute a set of ...

متن کامل

A Hopfield-Type Neural Network Based Model for Temporal Constraints

In this paper we present an approximation method based on discrete Hopfield neural network (DHNN) for solving temporal constraint satisfaction problems. This method is of interest for problems involving numeric and symbolic temporal constraints and where a solution satisfying the constraints of the problem needs to be found within a given deadline. More precisely the method has the ability to p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • KES Journal

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2013